Complexity of constraint satisfaction

Results: 53



#Item
41Constraint satisfaction problem / Computing / Constraint satisfaction / Constraint logic programming / Complexity of constraint satisfaction / Constraint programming / Software engineering / Computer programming

Random Constraint Satisfaction: Easy Generation of Hard (Satisfiable) Instances Ke Xu 1,∗ National Lab of Software Development Environment, School of Computers,

Add to Reading List

Source URL: www.nlsde.buaa.edu.cn

Language: English - Date: 2007-04-10 23:13:08
42Mathematics / Matrix theory / Local consistency / Complexity of constraint satisfaction / Linear algebra / Constraint programming / Matrix

Constraints manuscript No. (will be inserted by the editor) On Matrices, Automata, and Double Counting in Constraint Programming Nicolas Beldiceanu · Mats Carlsson · Pierre

Add to Reading List

Source URL: www.it.uu.se

Language: English - Date: 2012-11-22 04:43:49
43Cluster analysis / Graph coloring / Data mining / Geostatistics / Constrained clustering / K-means clustering / NP-complete / Consensus clustering / Complexity of constraint satisfaction / Statistics / Theoretical computer science / Mathematics

Intractability and Clustering with Constraints Ian Davidson [removed] S.S. Ravi [removed]

Add to Reading List

Source URL: www.machinelearning.org

Language: English - Date: 2008-12-01 11:26:24
44Algebraic structures / Universal algebra / Category theory / Semigroup theory / Variety / Semigroup / Constraint satisfaction / Groupoid / Monoid / Abstract algebra / Algebra / Mathematics

Conference on ALGORITHMIC COMPLEXITY AND UNIVERSAL ALGEBRA Dedicated to the 75th birthday of B´ela Cs´ ak´ any Szeged, Hungary, July 16–20, 2007

Add to Reading List

Source URL: www.math.u-szeged.hu

Language: English - Date: 2007-07-20 11:46:40
45Graph theory / Computational problems / NP-complete problems / Constraint programming / Graph coloring / 2-satisfiability / NP-complete / Graph homomorphism / Constraint satisfaction problem / Theoretical computer science / Mathematics / Computational complexity theory

Dichotomy Theorems for Counting Problems Jin-Yi Cai University of Wisconsin, Madison Xi Chen Columbia University

Add to Reading List

Source URL: pages.cs.wisc.edu

Language: English - Date: 2011-07-11 20:52:11
46Differential geometry / Differential topology / Mathematics / Commutative algebra / Theorems and definitions in linear algebra / Tangent space / Constraint programming / Constraint satisfaction problem / Lemmas

Non-negative Weighted #CSPs: An Effective Complexity Dichotomy Jin-Yi Cai University of Wisconsin, Madison Xi Chen

Add to Reading List

Source URL: pages.cs.wisc.edu

Language: English - Date: 2010-12-31 13:52:31
47Boolean algebra / NP-complete problems / Logic in computer science / Electronic design automation / Formal methods / Boolean satisfiability problem / True quantified Boolean formula / Interpretation / Constraint satisfaction problem / Theoretical computer science / Computational complexity theory / Applied mathematics

A Generalization of SAT and #SAT for Robust Policy Evaluation∗ Erik Zawadzki Andr´e Platzer Geoffrey J. Gordon

Add to Reading List

Source URL: www.cs.cmu.edu

Language: English - Date: 2013-11-06 19:31:44
48Constraint satisfaction problem / Mathematics / Computational complexity theory / Mathematical optimization / Probabilistic complexity theory / Constraint satisfaction / Combinatorial optimization / Approximation algorithm / Probabilistically checkable proof / Theoretical computer science / Constraint programming / Applied mathematics

Approximability of Constraint Satisfaction Problems Venkatesan Guruswami Carnegie Mellon University October 2009

Add to Reading List

Source URL: www.cs.cmu.edu

Language: English - Date: 2009-11-30 17:57:22
49Constraint programming / Computational complexity theory / Constraint satisfaction problem / 2-satisfiability / Constraint satisfaction / Approximation algorithm / Logic in computer science / Combinatorial optimization / Linear programming / Theoretical computer science / Applied mathematics / Mathematics

Every 2-CSP allows nontrivial approximation Johan H˚ astad Royal Institute of Technology

Add to Reading List

Source URL: www.nada.kth.se

Language: English - Date: 2005-06-22 08:43:27
UPDATE